Some Graph Labelings in Competition Graph of Cayley Digraphs
نویسندگان
چکیده
In this paper we present an algorithm and prove the existence of graph labelings such as Z 3 -magic, Cordial, total cordial, E-cordial, total E-cordial, Product cordial, total product cordial, Product E-cordial, total product E-cordial labelings for the Competition graph of the Cayley digraphs associated with the diheadral group D n . AMS SUBJECT CLASSIFICATION: 05C78.
منابع مشابه
Cayley graph associated to a semihypergroup
The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as Hamiltonian cycles in this graph. Also, by some of examples we will illustrate the properties and behavior of these Cayley graphs, in particulars we show that ...
متن کاملProduct Antimagic Labelings in Cayley Digraphs of 2-generated 2-groups
In this paper we introduce two new labelings called product antimagic labeling and total product antimagic labeling for directed graphs and show the existence of the same for Cayley digraphs of 2-generated 2groups. AMS Mathematics Subject Classification : 05C78.
متن کاملSOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH
In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...
متن کاملGraph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کامل